A Unified Proof of Two Classical Theorems on Cns Polynomials
نویسنده
چکیده
A sufficient condition for a monic integer polynomial to be a semi-CNS polynomial is presented. This result infers a unified proof of two well-known theorems on irreducible CNS polynomials thereby extending them to reducible polynomials.
منابع مشابه
Approximation by polynomials
1. Introduction 2. The Weierstrass approximation theorem 3. Estimates for the Bernstein polynomials 4. Weierstrass' original proof 5. The Stone–Weierstrass approximation theorem 6. Chebyshev's theorems 7. Approximation by polynomials and trigonometric polynomials 8. The nonexistence of a continuous linear projection 9. Approximation of functions of higher regularity 10. Inverse theorems Referen...
متن کاملTwo Sandwich Theorems for Linear Operators and the Moment Problem
We give a direct proof for theorem 2 [13] (which is equivalent to theorem 1 [15]). Then we apply theorems 1 [15] and 4 [15] to some concrete spaces of sequences or functions which have a Schauder basis. The polynomials xj(t) = t j , j ∈ N considered in the classical moment problem, are replaced by the elements of the Schauder basis. Mathematics Subject Classification: 46A22, 47A57.
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملAn Identity of Jack Polynomials
In this work we give an alterative proof of one of basic properties of zonal polynomials and generalised it for Jack polynomials
متن کاملMatching Polynomials And Duality
Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The number of r-matchings in G will be denoted by p(G,r). We set p(G,0)=1 and define the matching polynomial of G by μ(G,x):= ∑bn/2c r=0 (−1)·p(G,r)·x and the signless matching polynomial of G by μ(G,x):= ∑bn/2c r=0 p(G,r)·x. It is classical that the matching polynomials of a graph G determine the matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012